An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem

Improved Branch-Cut-and-Price for Capacitated Vehicle Routing

Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem

Abstract. The best exact algorithms for the Capacitated Vehicle Routing Problem (CVRP) have been based on either branch-and-cut or Lagrangean relaxation/column generation. This paper presents an algorithm that combines both approaches: it works over the intersection of two polytopes, one associated with a traditional Lagrangean relaxation over q-routes, the other defined by bound, degree and ca...

An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem

A multi-objective Two-Echelon Capacitated Vehicle Routing Problem for perishable products

This article addresses a general tri-objective two-echelon capacitated vehicle routing problem (2E-CVRP) to minimize the total travel cost, customers waiting times and carbon dioxide emissions simultaneously in distributing perishable products. In distributing perishable products, customers’ satisfaction is very important and is inversely proportional to the customers waiting times. The propose...

A Branch-and-Cut-and-Price Algorithm for the Capacitated Location-Routing Problem

In this paper we present an exact algorithm for the Capacitated LocationRouting Problem (CLRP) based on column and cut generation. The CLRP is formulated as a set-partitioning problem which also inherits all of the known valid inequalities for the flow formulations of the CLRP. We introduce five new families of inequalities that are shown to dominate some of the cuts from the two-index formulat...